Convolutional Codes: Construction and Encoding
ثبت نشده
چکیده
This chapter introduces a widely used class of codes, called convolutional codes, which are used in a variety of systems including today’s popular wireless standards (such as 802.11) and in satellite communications. They are also used as a building block in more powerful modern codes, such as turbo codes, which are used in wide-area cellular wireless network standards such as 3G, LTE, and 4G. Convolutional codes are beautiful because they are intuitive, one can understand them in many different ways, and there is a way to decode them so as to recover the most likely message from among the set of all possible transmitted messages. This chapter discusses the encoding of convolutional codes; the next one discusses how to decode convolutional codes efficiently. Like the block codes discussed in the previous chapter, convolutional codes involve the computation of parity bits from message bits and their transmission, and they are also linear codes. Unlike block codes in systematic form, however, the sender does not send the message bits followed by (or interspersed with) the parity bits; in a convolutional code, the sender sends only the parity bits. These codes were invented by Peter Elias ’44, an MIT EECS faculty member, in the mid-1950s. For several years, it was not known just how powerful these codes are and how best to decode them. The answers to these questions started emerging in the 1960s, with the work of people like Andrew Viterbi ’57, G. David Forney (SM ’65, Sc.D. ’67, and MIT EECS faculty member), Jim Omura SB ’63, and many others.
منابع مشابه
Convolutional encoding of 60, 64, 68, 72-bit self-dual codes
In this paper we obtain [60,30,12], [64,32,12], [68,34,12], [72,36,12] doubly even self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two add to the one of the encoder outputs and this row will replace the first row in the double circulant matrix. The pure double circulant construction with K=10 is also ...
متن کاملConstruction for obtaining trellis run length limited error control codes from convolutional codes
Recently a new construction of run length limited block error control codes based on control matrices of linear block codes was proposed. In this paper a similar construction for obtaining trellis run length limited error control codes from convolutional codes is described. The main advantage of it, beyond its simplicity is that it does not require any additional redundancy except the one which...
متن کاملLDPC Convolutional Codes Based on Permutation Polynomials over Integer Rings
A novel algebraic construction technique for LDPC convolutional codes (LDPCCCs) based on permutation polynomials over integer rings is presented. The underlying elements of this construction technique are graph automorphisms and quasi-cyclic (QC) codes. The algebraic structure of the obtained LDPCCCs, their encoding and decoding are discussed. These new codes have a special structure, which is ...
متن کاملHigh-rate systematic recursive convolutional encoders: minimal trellis and code search
We consider high-rate systematic recursive convolutional encoders to be adopted as constituent encoders in turbo schemes. Douillard and Berrou showed that, despite its complexity, the construction of high-rate turbo codes by means of high-rate constituent encoders is advantageous over the construction based on puncturing rate-1/2 constituent encoders. To reduce the decoding complexity of high-r...
متن کاملConvolutional Codes: Construction and Encoding
This chapter introduces a widely used class of codes, called convolutional codes, which are used in a variety of systems including today’s popular wireless standards (such as 802.11) and in satellite communications. They are also used as a building block in more powerful modern codes, such as turbo codes, which are used in wide-area cellular wireless network standards such as 3G, LTE, and 4G. C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011